Test Generation for a System of Communicating Finite State Machines

نویسندگان

  • Qi-Ping Yang
  • Tae-Hyong Kim
چکیده

A system of communicating finite state machines (SCFSM) is a usual design model of a complicated system composed of multiple communicating components. SCFSM testing usually depends on finite state machine (FSM) testing as an SCFSM can be converted to an equivalent FSM. SCFSM testing, however, should consider the properties of SCFSMs which are different from those of component FSMs. This paper proposes a test generation method for SCFSMs by analysing their properties. For the full fault coverage, SCFSM testing requires very long test sequences for detecting state addition faults. In order to reduce such test sequences, the proposed test case generation method uses individual reliable resets of component FSMs. Keyword-Communicating FSM, Test generation, Full fault coverage, Test sequence reduction, Observable product machine

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Test Case Generation from Asynchronously Communicating State Machines

This paper proposes an approach for generating test cases in Concurrent TTCN from a system of asynchronously communicating nite state machines. We give an algorithm for generating a noninterleaving model of prime event structures from a generalized model of asynchronously communicating nite state machines and deal with the generation of test cases from prime event structures.

متن کامل

Test Selection Based on Communicating Nondeterministic Finite-State Machines Using a Generalized WP-Method

We present a method of generating test sequences for concurrent programs and communication protocols that are modeled as communicating nondeterministic finite state machines (CNFSMs). A conformance relation, called trace-equivalence, is defined within this model, serving as a guide to test generation. A test generation method for a single nondeterministic finite state machine (NFSM) is develope...

متن کامل

Automatic Generation of Test Purposes for Testing Distributed Systems

In this paper, we present an algorithm for generating test purpose descriptions in form of MSC’s from a given labeled event structure that represents the behavior of a system of asynchronously communicating extended finite state machines. The labeled event structure is a non-interleaving behavior model describing the behavior of a system in terms of the partial ordering of events.

متن کامل

Diagnosing Distributed Systems Modeled by Communicating Finite State Machines

We propose a diagnostic algorithm for the case where a distributed system specification (implementation) is given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptoms and which perm...

متن کامل

Diagnosis of Single Transition Faults in Communicating Finite State Machines

In this paper, we propose a diagnostic algorithm for the case where distributed system specifications (implementations) are given in the form of communicating finite state machines (CFSMs). Such an algorithm localizes the faulty transition in the distributed system once the fault has been detected. It generates, if necessary, additional diagnostic test cases which depend on the observed symptom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013